Efficient Approaches for Designing the Logical Reversibility of Computation
نویسندگان
چکیده
The work demonstrates about the reversible logic synthesis for the 2 to 4 decoder, the circuits are designed using reversible fault tolerant toffoli gates. Thus the entire scheme inherently becomes fault tolerant. In addition, several lower bounds on the number of constant inputs, garbage outputs and quantum cost of the reversible fault tolerant decoder have been proposed. Transistor simulations of the proposed decoder power consumption have been reduced than the existing approach without decreasing the speed, which proved the functional correctness of the proposed Decoder. The comparative results show that the proposed design is much better in terms of quantum cost, delay, hardware complexity and has significantly better scalability. Tanner software is the advanced industrial tool that is growing up in trend. So the proposed decoder is designed in Tanner EDA after completion of the circuit in DSCH and Microwind. This shows the power dissipation and power consumption at each nook and corner to re-design with low power consumption possible.
منابع مشابه
Logical reversibility
A method has been developed for transforming a program written in the probabilistic guarded-command language ( pGCL) into an equivalent but reversible program. The method extends previous work on logical reversibility to that language and pertains to “demonic” nondeterminism and probability. Use is made of a formal definition of logical reversibility and the expectation-transformer semantics fo...
متن کاملChecking Reversibility of Boolean Functions
Following the reversible computation paradigm is essential in the design of many emerging technologies such as quantum computation or dedicated low power concepts. The design of corresponding circuits and systems heavily relies on information about whether the function to be realized is indeed reversible. In particular in hierarchical synthesis approaches where a given function is decomposed in...
متن کاملA duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملAn Enhanced HL-RF Method for the Computation of Structural Failure Probability Based On Relaxed Approach
The computation of structural failure probability is vital importance in the reliability analysis and may be carried out on the basis of the first-order reliability method using various mathematical iterative approaches such as Hasofer-Lind and Rackwitz-Fiessler (HL-RF). This method may not converge in complicated problems and nonlinear limit state functions, which usually shows itself in the f...
متن کاملDesigning a logical data model of athletes' hospital information management system based on international standards
Background and purpose: Today, hospital care, relying on the health record system, has received more attention than before. Considering the diversity of data in these systems, the design of standard conceptual and logical models by service providers will play an important role in their success. Therefore, this research was conducted with the aim of designing a logical data model of the hospital...
متن کامل